On the security of FCSR-based pseudorandom generators
نویسندگان
چکیده
This article describes new theoretical results concerning the general behavior of an FCSR automaton that allow to better understand the initial parameters that must be chosen to use this automaton as a basic block of a filtering stream cipher. The results demonstrated here especially concern the structure of the subjacent graph of an FCSR automaton, its entropy and the number of iterations of the FCSR transition function required to reach the main part of the graph. A linear weakness and a way to discard the induced potential attack are also given. The parameters chosen for the two candidates F-FCSR-16 and F-FCSR-H make this attack impossible.
منابع مشابه
Investigation of FCSR-based Pseudorandom Sequence Generators for Stream Ciphers
In this paper, feedback with carry shift registers (FCSRs) are analyzed with main focus on the general case of FCSRs with arbitrary connection integer and on maximum-period FCSRs. Moreover, a keystream generator that employs the structure of the linear feedback shift register (LFSR)-based Geffegenerator is studied in connection with FCSRs as a special nonlinear combining generator. The consider...
متن کاملSome Remarks on FCSRs and Implications for FCSR-based Stream Ciphers
Feedback with carry shift registers (FCSRs) have been discussed for over ten years in the context of efficient pseudorandom number generation, particularly as an alternative to linear feedback shift registers (LFSRs) [6, 10, 11]. Similarly to LFSRs, FCSRs have an underlying algebraic structure that facilitates their analysis, and their output sequences have many desirable statistical properties...
متن کاملSecurity Frameworks for Pseudorandom Number Generators
In the cryptographic system a pseudorandom number generator is one of the basic primitives. We survey theoretically secure pseudorandom bit generators which are provably secure under certain reasonable number theoretic assumptions and some practical pseudorandom number generators based on assumptions about symmetric crypto-primitives. Recently, there was a noticeable result for the concrete sec...
متن کاملState Recovery Attacks on Pseudorandom Generators
State recovery attacks comprise an important class of attacks on pseudorandom generators. In this paper we analyze resistance of pseudorandom generators against these attacks in terms of concrete security. We show that security of the BlumMicali pseudorandom generator against state recovery attacks is tightly related to the security of the corresponding one-way function. C. Wolf, S. Lucks, P.-W...
متن کاملSoftware Implementation of P−adic Self−shrinking Generator for Aerospace Cryptographic Systems
To be suitable for use in aerospace cryptographic systems software-oriented stream ciphers must be fast, uniform, scalable, consistent and unpredictable. With regard in the paper the software implementation of a fast stream cipher, named Self−Shrinking p−adic Generator which produces 8 bits (SSPG-8) in one clock cycle, is proposed. The theoretical base of Self-Shrinking p-adic Generator is reca...
متن کامل